A cubically convergent class of root finding iterative methods
نویسنده
چکیده
In this paper, we propose a new two-parameter class of iterative methods to solve a nonlinear equation. It is proved that any method in this class is cubically convergent if and only if the parameters sum up to one. Some of the existing third-order methods, by suitable selection of parameters, can be put in this class. Every iteration of the class requires an evaluation of the function, three of the first derivative, and none of the second derivative. Hence, its efficiency index is that is worse than all other
منابع مشابه
Point Estimation of Cubically Convergent Root Finding Method of Weierstrass’ Type
The aim of this paper is to state initial conditions for the safe and fast convergence of the simultaneous method of Weierstrass’ type for finding simple zeros of algebraic polynomial. This conditions are computationally verifiable and they depend only on the available data polynomial coefficients, its degree and initial approximations z 1 , . . . , z (0) n to the zeros. It is shown that under ...
متن کاملAnother Simple Way of Deriving Several Iterative Functions to Solve Nonlinear Equations
We present another simple way of deriving several iterative methods for solving nonlinear equations numerically. The presented approach of deriving these methods is based on exponentially fitted osculating straight line. These methods are the modifications of Newton’s method. Also, we obtain well-known methods as special cases, for example, Halley’s method, super-Halley method, Ostrowski’s squa...
متن کاملA Family of Root Finding Methods*
A one parameter family of iteration functions for finding roots is derived. ] h e family includes the Laguerre, Halley, Ostrowski and Euler methods and, as a limiting case, Newton's method. All the methods of the family are cubically convergent for a simple root (except Newton's which is quadratically convergent). The superior behavior of Laguerre's method, when starting from a point z for whic...
متن کاملOn a Cubically Convergent Iterative Method for Matrix Sign
We propose an iterative method for finding matrix sign function. It is shown that the scheme has global behavior with cubical rate of convergence. Examples are included to show the applicability and efficiency of the proposed scheme and its reciprocal.
متن کاملNote on Super - Halley Method and its Variants
In this paper, we propose a new cubically convergent family of superHalley method based on power means. Some well-known methods can be regarded as particular cases of the proposed family. New classes of higher (third and fourth) order multipoint iterative methods free from second order derivative are derived by semi-discrete modifications of above-mentioned methods. It is shown that super-Halle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014